Long cycles and spanning subgraphs of locally maximal 1‐planar graphs
نویسندگان
چکیده
منابع مشابه
Spanning Maximal Planar Subgraphs of Random Graphs
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn . We show that it is very near p = ~TTOWe also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near
متن کاملSpanning eulerian subgraphs in N2-locally connected claw-free graphs
A graph G is Nm-locally connected if for every vertex v in G, the vertices not equal to v and with distance at most m to v induce a connected subgraph in G. We show that both connectedN2-locally connected claw-free graph and 3-edge-connected N3-locally connected claw-free graph have connected even [2, 4]-factors, which settle a conjecture by Li in [6].
متن کاملSpanning eulerian subgraphs in N -locally connected claw-free graphs
A graph G is Nm-locally connected if for every vertex v in G, the vertices not equal to v and with distance at most m to v induce a connected subgraph in G. We show that both connected N2-locally connected claw-free graph and 3-edge-connected N3-locally connected claw-free graph have connected even [2, 4]-factors, which settle a conjecture by Li in [6].
متن کاملLong cycles in subgraphs of (pseudo)random directed graphs
We study the resilience of random and pseudorandom directed graphs with respect to the property of having long directed cycles. For every 0 < γ < 1/2 we find a constant c = c(γ) such that the following holds. Let G = (V,E) be a (pseudo)random directed graph on n vertices and with at least a linear number of edges, and let G′ be a subgraph of G with (1/2 + γ)|E| edges. Then G′ contains a directe...
متن کاملMinimum Face-Spanning Subgraphs of Plane Graphs
A plane graph is a planar graph with a fixed embedding. Let G = (V,E) be an edge weighted connected plane graph, where V and E are the set of vertices and edges, respectively. Let F be the set of faces of G. For each edge e ∈ E, let w(e) ≥ 0 be the weight of the edge e of G. A face-spanning subgraph of G is a connected subgraph H induced by a set of edges S ⊆ E such that the vertex set of H con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2020
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22542